Solving 10385 - Duathlon (Ternary search)
[andmenj-acm.git] / 10302 - Summation of polynomials / gen.cpp
blobefebc17297f615a83d30800e77e821864e35dcd7
1 /*
2 Problem:
3 Andrés Mejía-Posada (andmej@gmail.com)
4 */
5 using namespace std;
6 #include <algorithm>
7 #include <iostream>
8 #include <iterator>
9 #include <sstream>
10 #include <fstream>
11 #include <cassert>
12 #include <climits>
13 #include <cstdlib>
14 #include <cstring>
15 #include <string>
16 #include <cstdio>
17 #include <vector>
18 #include <cmath>
19 #include <queue>
20 #include <deque>
21 #include <stack>
22 #include <list>
23 #include <map>
24 #include <set>
26 #define foreach(x, v) for (typeof (v).begin() x = (v).begin(); x != (v).end(); ++x)
27 #define D(x) cout << #x " is " << x << endl
29 int main(){
30 for (int i=0; i<100; ++i)
31 for (int j=0; j<=50000; ++j)
32 printf("%d\n", j);
33 return 0;